A fully polynomial approximation scheme for the single machine weighted total tardiness problem with a common due date
نویسندگان
چکیده
منابع مشابه
A faster fully polynomial approximation scheme for the single-machine total tardiness problem
Lawler [E.L. Lawler, A fully polynomial approximation scheme for the total tardiness problem, Operations Research Letters 1 (1982) 207–208] proposed a fully polynomial approximation scheme for the single-machine total tardiness problem which runs in O n 7 e time (where n is the number of jobs and e is the desired level of approximation). A faster fully polynomial approximation scheme running in...
متن کاملSingle Machine and Parallel Machine Scheduling Problems with a Common Due Date to Minimize Total Weighted Tardiness
This paper deals with a common due date parallel machines scheduling problem in which each job has a different tardiness penalty. The objective is to minimize the total weighted tardiness. The scheduling problem of minimizing the total weighted tardiness with a common due date on a single machine is known to be ordinary NP-hard. This is also the case for problem Pm|di = d| ∑ wiTi. A new dynamic...
متن کاملSingle-Machine Common Due Date Total Earliness/Tardiness Scheduling with Machine Unavailability
Research on non-regular performance measures is at best scarce in the deterministic machine scheduling literature with machine unavailability constraints. Moreover, almost all existing works in this area assume either that processing on jobs interrupted by an interval of machine unavailability may be resumed without any additional setup/processing or that all prior processing is lost. In this w...
متن کاملSingle .machine Total Weighted Tardiness with Release Dates Single Machine Total Weighted Tardiness with Release Dates
The single machine total weighted tardiness with release dates problem is known to be strongly NP-hard. With a new lower bounding scheme and a new upper bounding scheme, we get an efficient branch and bound algorithm. In the paper, we first introduce the history of the problem and its computational complexity. Second, the lower bounding schemes and the upper bounding schemes are described in de...
متن کاملMinimizing Total Weighted Tardiness with Drop Dead Dates in Single Machine Scheduling Problem
This paper deals with minimization of tardiness in single machine scheduling problem when each job has two different due-dates i.e. ordinary due-date and drop dead date. The drop dead date is the date in which jobs’ weights rise sharply or the customer cancels the order. A linear programming formulation is developed for the problem and since the problem is known to be NP-hard, three heuristic...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2006
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2006.08.030